Pure Gauss Sums over Finite Fields
نویسنده
چکیده
New classes of pairs e,p are presented for which the Gauss sums corresponding to characters of order e over finite fields of characteristic p are pure, i.e., have a real power. Certain pure Gauss sums are explicitly evaluated. §
منابع مشابه
A STICKLEBERGER THEOREM FOR p-ADIC GAUSS SUMS
Character sums over finite fields have been widely studied since Gauss. During the last decade, coding theorists initiated the study of a new type of sums, over points with coordinates in a p-adic field. Let O (u) m be the ring of integers of Q p(ζpm−1), the unramified extension of degree m of the field of p-adic numbers Q p obtained by adjoining the (p−1)-th roots of unity, Tm = T ∗ m∪{0}, whe...
متن کاملExtension Theorems for the Fourier Transform Associated with Non-degenerate Quadratic Surfaces in Vector Spaces over Finite Fields
We study the restriction of the Fourier transform to quadratic surfaces in vector spaces over finite fields. In two dimensions, we obtain the sharp result by considering the sums of arbitrary two elements in the subset of quadratic surfaces on two dimensional vector spaces over finite fields. For higher dimensions, we estimate the decay of the Fourier transform of the characteristic functions o...
متن کاملSums of Gauss sums and weights of irreducible codes
We develop a matrix approach to compute a certain sum of Gauss sums which arises in the study of weights of irreducible codes. A lower bound on the minimum weight of certain irreducible codes is given.
متن کاملOn the weight distributions of a class of cyclic codes
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases in [14, 15, 16]. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special case. We make extensive use of standard tools in number theory such as characters of finite fields, the Gauss sums and the Jacobi sums to tra...
متن کاملEfficient Quantum Algorithms for Estimating Gauss Sums
We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction from the discrete logarithm problem to Gauss sum estimation we also give evidence that this problem is hard for classical algorithms. The workings of the quantu...
متن کامل